TOPE = 2000000 #two million

def isPrime(n):
	n = abs(n)
	if (n < 4):
		return True
	else:	
		for i in range(2, (n/2)+1):
			if (n % i == 0):
				return False
	return True

if __name__ == "__main__":
	import os
	os.system("cls")
	s = 0
	for x in range(2, TOPE):
		if isPrime(x):
			s = s + x
	print "\n\t", s, "\n"
